Le coq médiéval

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coq in Coq

We formalize the deenition and the metatheory of the Calculus of Constructions (CC) using the proof assistant Coq. In particular, we prove strong nor-malization and decidability of type inference. From the latter proof, we extract a certiied Objective Caml program which performs type inference in CC and use this code to build a small-scale certiied proof-checker.

متن کامل

Formalisation en Coq et visualisation d'un cours de géométrie pour le lycée

Teaching high-school mathematics using a general theorem prover becomes a reachable goal for the near future. In this article, we present a library dealing with geometry in Coq. This library is dedicated to high-school teaching. We stress on using a graphical interface and a drawing tool which ease the accessibility to formal statements. We present some significant examples of statements with f...

متن کامل

Extraction certifiée dans Coq-en-Coq

The Coq proof assistant allows generation of programs correct by construction. This feature—called extraction—can be used to build certified libraries. In this article, we present a formalization of the extraction in Coq, along with some properties that have been formally proved. This work is in line with B. Barras’s work on formalizing Coq in Coq. MOTS-CLÉS : assistant de preuve, calcul des co...

متن کامل

Sets in Coq, Coq in Sets

We present a Coq reflexive tactic for deciding equalities or inequalities in Kleene algebras. This tactic is part of a larger project, whose aim is to provide tools for reasoning about binary relations in Coq: binary relations form a Kleene algebra, where the star operation is the reflexive transitive closure. Our tactic relies on an initiality theorem, whose proof goes by replaying finite auto...

متن کامل

Coq in

We formalize the deenition and the metatheory of the Calculus of Constructions (CC) using the proof assistant Coq. In particular, we prove strong nor-malization and decidability of type inference. From the latter proof, we extract a certiied Objective Caml program which performs type inference in CC and use this code to build a small-scale certiied proof-checker.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Revue d’ethnoécologie

سال: 2017

ISSN: 2267-2419

DOI: 10.4000/ethnoecologie.3288